|
A binary image is a digital image that has only two possible values for each pixel. Typically, the two colors used for a binary image are black and white, though any two colors can be used. The color used for the object(s) in the image is the foreground color while the rest of the image is the background color. In the document-scanning industry, this is often referred to as "bi-tonal". Binary images are also called ''bi-level'' or ''two-level''. This means that each pixel is stored as a single bit—i.e., a 0 or 1. The names ''black-and-white'', ''B&W'', monochrome or monochromatic are often used for this concept, but may also designate any images that have only one sample per pixel, such as grayscale images. In Photoshop parlance, a binary image is the same as an image in "Bitmap" mode. Binary images often arise in digital image processing as masks or as the result of certain operations such as segmentation, thresholding, and dithering. Some input/output devices, such as laser printers, fax machines, and bilevel computer displays, can only handle bilevel images. A binary image can be stored in memory as a bitmap, a packed array of bits. A 640×480 image requires 37.5 KiB of storage. Because of the small size of the image files, fax machine and document management solutions usually use this format. Most binary images also compress well with simple run-length compression schemes. Binary images can be interpreted as subsets of the two-dimensional integer lattice ''Z''2; the field of morphological image processing was largely inspired by this view. == Operations on binary images == An entire class of operations on binary images operates on a 3×3 window of the image. This contains nine pixels, so 516 possible values. Considering only the central pixel, it is possible to define whether it remains set or unset, based on the surrounding pixels. Examples of such operations are thinning, dilating, finding branch points and endpoints, removing isolated pixels, shifting the image a pixel in any direction, and breaking H-connections. Conway's Game of Life is also an example of a 3×3 window operation. Another class of operations is based on the notion of filtering with a structuring element. The structuring element is binary image, usually small, which is passed over the target image, in a similar manner to a filter in gray scale image processing. Since the pixels can only have two values, the morphological operations are erosion (any unset pixels within the structuring element cause the pixel to be unset) and dilation (any set pixels within the structuring element cause the pixel to be set). Important operations are morphological opening and morphological closing which consist of erosion followed by dilation and dilation followed by erosion, respectively, using the same structuring element. Opening tends to enlarge small holes, remove small objects, and separate objects. Closing retains small objects, removes holes, and joins objects. A very important characteristic of a binary image is the distance transform. This gives the distance of every set pixel from the nearest unset pixel. The distance transform can be efficiently calculated. It allows efficient computation of Voronoi diagrams, where each pixel in an image is assigned to the nearest of a set of points. It also allows skeletonization, which differs from thinning in that skeletons allow recovery of the original image. The distance transform is also useful for determining the centre of the object, and for matching in image recognition. Another class of operations is gathering orientation-free metrics. This is often important in image recognition where the orientation of the camera needs to be removed. Orientation-free metrics of a group of connected or surrounded pixels include the Euler number, the perimeter, the area, the compactness, the area of holes, the minimum radius, the maximum radius. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Binary image」の詳細全文を読む スポンサード リンク
|